# ---
# title: 513. Find Bottom Left Tree Value
# id: problem513
# author: Tian Jun
# date: 2020-10-31
# difficulty: Medium
# categories: Tree, Depth-first Search, Breadth-first Search
# link: <https://leetcode.com/problems/find-bottom-left-tree-value/description/>
# hidden: true
# ---
# 
# Given a binary tree, find the leftmost value in the last row of the tree.
# 
# **Example 1:**  
# 
#     
#     
#     Input:
#     
#         2
#        / \
#       1   3
#     
#     Output:
#     1
#     
# 
# **Example 2:**  
# 
#     
#     
#     Input:
#     
#             1
#            / \
#           2   3
#          /   / \
#         4   5   6
#            /
#           7
#     
#     Output:
#     7
#     
# 
# **Note:** You may assume the tree (i.e., the given root node) is not **NULL**.
# 
# 
## @lc code=start
using LeetCode

## add your code here:
## @lc code=end
